Quantum Tunneling Parameter in Global Optimization
نویسندگان
چکیده
منابع مشابه
Global sensitivity analysis for subsoil parameter estimation in mechanized tunneling
The present paper validates two alternative global sensitivity analysis methods, namely variance-based and elementary effect, for the purpose of detecting key subsoil parameters that influence the output of mechanized tunnel finite element simulation. In the elementary effect method, a strategy for considering the dependencies, that result from a set of constraints between different parameters,...
متن کاملSensitivity optimization in quantum parameter estimation
We present a general framework for sensitivity optimization in quantum parameter estimation schemes based on continuous ~indirect! observation of a dynamical system. As an illustrative example, we analyze the canonical scenario of monitoring the position of a free mass or harmonic oscillator to detect weak classical forces. We show that our framework allows the consideration of sensitivity sche...
متن کاملQUANTUM TUNNELING IN MEDIUMS WITH LINEAR AND NONLINEAR DISSIPATION
We have applied the method of integration of the Heisenberg equation of motion proposed by Bender and Dunne, and M. Kamella and M. Razavy to the potential V(q) = v q - µ q with linear and nonlinear dissipation. We concentrate our calculations on the evolution of basis set of Weyl Ordered Operators and calculate the mean position , velocity , the commutation relation [q, p], and the energ...
متن کاملTunneling and Speedup in Quantum Optimization for Permutation-Symmetric Problems
Siddharth Muthukrishnan, Tameem Albash, and Daniel A. Lidar Department of Physics and Astronomy, University of Southern California, Los Angeles, California 90089, USA Center for Quantum Information Science and Technology, University of Southern California, Los Angeles, California 90089, USA Information Sciences Institute, University of Southern California, Marina del Rey, Califirona 90292, USA ...
متن کاملAram Harrow - Quantum Monte Carlo vs Tunneling in Adiabatic Optimization
In this talk I'll present a quantum algorithm for solving semidefinite programs (SDPs). It has worst case running time O((nm)^1/2 r), with n and r the dimension and sparsity of the input matrices, respectively, and m the number of constraints. In contrast any classical method requires at least Omega(nm) time to solve the problem. I'll discuss how for some instances the algorithm might offer eve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Society of Instrument and Control Engineers
سال: 2010
ISSN: 0453-4654,1883-8189
DOI: 10.9746/sicetr.46.336